Distributed Algorithms for Computation of Fair Rates in MultirateMulticast

نویسندگان

  • Saswati Sarkar
  • Leandros Tassiulas
چکیده

1 Distributed Algorithms for Computation of Fair Rates in Multirate Multicast Trees Saswati Sarkar and Leandros Tassiulas Dept. of Electrical and Computer Engineering and Institute for Systems Research University of Maryland, College Park, MD, USA email addresses: [email protected], [email protected] Abstract|We study fairness in arbitrary networks with multicast capabilities. Multicast tra c in internet and ATM provides a motivation for studying these networks. A study of fairness in multicast networks poses several interesting problems e.g., the issue of intra-session fairness in addition to that of inter-session fairness in unicast networks. We develop a mathematical framework to model the fair allocation of bandwidth in multirate multicast networks with minimum and maximum rate constraints. We present distributed algorithms for computation of maxmin fair rates allocated to various source-destination pairs.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Distributed Algorithms for Computation of Fair Rates in Multirate Multicast Trees

Multicast Trees Saswati Sarkar and Leandros Tassiulas Dept. of Electrical and Computer Engineering and Institute for Systems Research University of Maryland, College Park, MD, USA email addresses: [email protected], [email protected] Abstract|We study fairness in arbitrary networks with multicast capabilities. Multicast tra c in internet and ATM provides a motivation for studying these netwo...

متن کامل

IN PROCEEDINGS OF ALLERTON ' 99 1 Fair Allocation of Utilities in MultirateMulticast

We study fairness in a multicast network. We assume that the source hierarchically encodes its signal and the hierarchical structure is predetermined. We study fair allocation of utilities, where utility of a bandwidth can be the number of layers or the bandwidth itself, or any other function of the bandwidth depending on system requirements. The utility function is not strictly increasing in g...

متن کامل

A Fast Distributed Stateless Algorithm for α-Fair Packing Problems∗

We study weighted α-fair packing problems, that is, the problems of maximizing the objective functions (i) ∑ j wjx 1−α j /(1−α) when α > 0, α 6= 1 and (ii) ∑ j wj ln xj when α = 1, over linear constraints Ax ≤ b, x ≥ 0, where wj are positive weights and A and b are non-negative. We consider the distributed computation model that was used for packing linear programs and network utility maximizat...

متن کامل

A Fast Distributed Algorithm for α-Fair Packing Problems

Over the past two decades, fair resource allocation problems received considerable attention in avariety of application areas. While polynomial time distributed algorithms have been designed formax-min fair resource allocation, the design of distributed algorithms with convergence guarantees forthe more general α−fair allocations received little attention. In this paper, we stud...

متن کامل

Distributed Algorithms for Max-Min Fair Rate Allocation in ALOHA Networks

This paper addresses the problem of max-min fair rate allocation in ALOHA networks. In spite of the nonseparability and non-convexity of the problem, we show how globally optimal rates can be obtained in a distributed manner, using only local coordination. We propose two iterative, decentralized algorithms for this problem, and demonstrate their convergence to optimality through analysis and si...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000